Efficient simulation budget allocation for subset selection using regression metamodels

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

We consider a variation of the subset selection problem in ranking and selection, where motivated by recently developed global optimization approaches applied to simulation optimization, our objective is to identify the top-m out of k designs based on simulated output. Using the optimal computing budget framework, we formulate the problem as that of maximizing the probability of correctly selec...

متن کامل

An alternative simulation budget allocation scheme for efficient simulation

We present an alternative simulation run allocation scheme for maximizing efficiency in simulation experiments for decision making under uncertainty. The issue of simulation efficiency is addressed from two perspectives: i) We want to minimize the total computation cost, with a constraint that the overall simulation quality must be higher than a desired level; ii) we would like to maximize the ...

متن کامل

Using subsystem linear regression metamodels in stochastic simulation

This article explores the use of metamodels as simulation building blocks. The metamodel replaces a part of the simulation model with a mathematical function that mimics the input–output behavior of that part, with respect to some measure of interest to the designer. The integration of metamodels as components of the simulation model simplifies the model and reduces the simulation time. Such us...

متن کامل

Group subset selection for linear regression

Two fast group subset selection (GSS) algorithms for the linear regression model are proposed in this paper. GSS finds the best combinations of groups up to a specified size minimising the residual sum of squares. This imposes an l0 constraint on the regression coefficients in a group context. It is a combinatorial optimisation problem with NP complexity. To make the exhaustive search very effi...

متن کامل

Subset Selection for Efficient SVM Tracking

We update the SVM score of an object through a video sequence with a small and variable subset of support vectors. In the first frame we use all the support vectors to compute the SVM score of the object but in subsequent frames we use only a small and variable subset of support vectors to update the SVM score. In each frame we calculate the dot-products of the support vectors in the subset wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2019

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2019.05.022